0.09/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.10 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.09/0.31 % Computer : n026.cluster.edu 0.09/0.31 % Model : x86_64 x86_64 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.31 % Memory : 8042.1875MB 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.31 % CPULimit : 1920 0.09/0.31 % WCLimit : 240 0.09/0.31 % DateTime : Wed Jul 30 03:38:34 EDT 2025 0.09/0.31 % CPUTime : 0.16/0.44 Running higher-order theorem proving 0.16/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.ERvvq1DCGB/E---3.1_32375.p 0.16/0.45 # Version: 3.0.0-ho 0.16/0.45 # Preprocessing class: HSSSSMSSSSSNSSA. 0.16/0.45 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.16/0.45 # Starting post_as_ho12 with 240s (1) cores 0.16/0.45 # Starting new_bool_9 with 240s (1) cores 0.16/0.45 # Starting post_as_ho1 with 240s (1) cores 0.16/0.45 # Starting post_as_ho4 with 240s (1) cores 0.16/0.45 # Starting post_as_ho2 with 240s (1) cores 0.16/0.45 # Starting ehoh_best2_full_lfho with 240s (1) cores 0.16/0.45 # Starting full_lambda_10 with 240s (1) cores 0.16/0.45 # Starting new_ho_8 with 240s (1) cores 0.16/0.45 # post_as_ho12 with pid 32453 completed with status 0 0.16/0.45 # Result found by post_as_ho12 0.16/0.45 # Preprocessing class: HSSSSMSSSSSNSSA. 0.16/0.45 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.16/0.45 # Starting post_as_ho12 with 240s (1) cores 0.16/0.45 # No SInE strategy applied 0.16/0.45 # Search class: HGUSF-FFSF11-SSSFFMBN 0.16/0.45 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.16/0.45 # Starting post_as_ho4 with 130s (1) cores 0.16/0.45 # post_as_ho4 with pid 32461 completed with status 0 0.16/0.45 # Result found by post_as_ho4 0.16/0.45 # Preprocessing class: HSSSSMSSSSSNSSA. 0.16/0.45 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.16/0.45 # Starting post_as_ho12 with 240s (1) cores 0.16/0.45 # No SInE strategy applied 0.16/0.45 # Search class: HGUSF-FFSF11-SSSFFMBN 0.16/0.45 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.16/0.45 # Starting post_as_ho4 with 130s (1) cores 0.16/0.45 # Preprocessing time : 0.001 s 0.16/0.45 # Presaturation interreduction done 0.16/0.45 0.16/0.45 # Proof found! 0.16/0.45 # SZS status Theorem 0.16/0.45 # SZS output start CNFRefutation 0.16/0.45 thf(decl_23, type, b: $i). 0.16/0.45 thf(decl_24, type, cP: $i > $o). 0.16/0.45 thf(decl_25, type, a: $i). 0.16/0.45 thf(decl_26, type, esk1_1: ($i > $o) > $i). 0.16/0.45 thf(cBLEDSOE6, conjecture, ?[X1:$i > $o]:(((((a)!=(b))&(cP @ a))=>((![X2:$i]:(((cP @ X2)<=(X1 @ X2)))&?[X3:$i]:((X1 @ X3)))&~((X1 @ b))))), file('/export/starexec/sandbox2/tmp/tmp.ERvvq1DCGB/E---3.1_32375.p', cBLEDSOE6)). 0.16/0.45 thf(c_0_1, negated_conjecture, ~(?[X1:$i > $o]:(((((a)!=(b))&(cP @ a))=>((![X2:$i]:(((X1 @ X2)=>(cP @ X2)))&?[X3:$i]:((X1 @ X3)))&~((X1 @ b)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBLEDSOE6])])). 0.16/0.45 thf(c_0_2, negated_conjecture, ![X7:$i > $o, X9:$i]:(((((a)!=(b))&(cP @ a))&(((X7 @ (esk1_1 @ X7))|~(X7 @ X9)|(X7 @ b))&(~(cP @ (esk1_1 @ X7))|~(X7 @ X9)|(X7 @ b))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])])). 0.16/0.45 thf(c_0_3, negated_conjecture, ![X1:$i > $o, X2:$i]:(((X1 @ b)|~((cP @ (esk1_1 @ X1)))|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.16/0.45 thf(c_0_4, negated_conjecture, ![X1:$i > $o, X2:$i]:(((X1 @ (esk1_1 @ X1))|(X1 @ b)|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.16/0.45 thf(c_0_5, negated_conjecture, ![X2:$i]:((((b)=(X2))|~((cP @ (esk1_1 @ (^[Z0/* 3 */:$i]:(((Z0)=(X2))))))))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])). 0.16/0.45 thf(c_0_6, negated_conjecture, ![X2:$i]:((((esk1_1 @ (^[Z0/* 3 */:$i]:(((Z0)=(X2)))))=(X2))|((b)=(X2)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_4])). 0.16/0.45 thf(c_0_7, negated_conjecture, ![X2:$i]:((((b)=(X2))|~((cP @ X2)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.16/0.45 thf(c_0_8, negated_conjecture, (cP @ a), inference(split_conjunct,[status(thm)],[c_0_2])). 0.16/0.45 thf(c_0_9, negated_conjecture, ((a)!=(b)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.16/0.45 thf(c_0_10, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), ['proof']). 0.16/0.45 # SZS output end CNFRefutation 0.16/0.45 # Parsed axioms : 4 0.16/0.45 # Removed by relevancy pruning/SinE : 0 0.16/0.45 # Initial clauses : 7 0.16/0.45 # Removed in clause preprocessing : 3 0.16/0.45 # Initial clauses in saturation : 4 0.16/0.45 # Processed clauses : 18 0.16/0.45 # ...of these trivial : 0 0.16/0.45 # ...subsumed : 0 0.16/0.45 # ...remaining for further processing : 18 0.16/0.45 # Other redundant clauses eliminated : 0 0.16/0.45 # Clauses deleted for lack of memory : 0 0.16/0.45 # Backward-subsumed : 0 0.16/0.45 # Backward-rewritten : 1 0.16/0.45 # Generated clauses : 37 0.16/0.45 # ...of the previous two non-redundant : 18 0.16/0.45 # ...aggressively subsumed : 0 0.16/0.45 # Contextual simplify-reflections : 1 0.16/0.45 # Paramodulations : 18 0.16/0.45 # Factorizations : 1 0.16/0.45 # NegExts : 0 0.16/0.45 # Equation resolutions : 4 0.16/0.45 # Disequality decompositions : 0 0.16/0.45 # Total rewrite steps : 13 0.16/0.45 # ...of those cached : 11 0.16/0.45 # Propositional unsat checks : 0 0.16/0.45 # Propositional check models : 0 0.16/0.45 # Propositional check unsatisfiable : 0 0.16/0.45 # Propositional clauses : 0 0.16/0.45 # Propositional clauses after purity: 0 0.16/0.45 # Propositional unsat core size : 0 0.16/0.45 # Propositional preprocessing time : 0.000 0.16/0.45 # Propositional encoding time : 0.000 0.16/0.45 # Propositional solver time : 0.000 0.16/0.45 # Success case prop preproc time : 0.000 0.16/0.45 # Success case prop encoding time : 0.000 0.16/0.45 # Success case prop solver time : 0.000 0.16/0.45 # Current number of processed clauses : 13 0.16/0.45 # Positive orientable unit clauses : 2 0.16/0.45 # Positive unorientable unit clauses: 0 0.16/0.45 # Negative unit clauses : 1 0.16/0.45 # Non-unit-clauses : 10 0.16/0.45 # Current number of unprocessed clauses: 8 0.16/0.45 # ...number of literals in the above : 20 0.16/0.45 # Current number of archived formulas : 0 0.16/0.45 # Current number of archived clauses : 5 0.16/0.45 # Clause-clause subsumption calls (NU) : 9 0.16/0.45 # Rec. Clause-clause subsumption calls : 9 0.16/0.45 # Non-unit clause-clause subsumptions : 1 0.16/0.45 # Unit Clause-clause subsumption calls : 0 0.16/0.45 # Rewrite failures with RHS unbound : 0 0.16/0.45 # BW rewrite match attempts : 1 0.16/0.45 # BW rewrite match successes : 1 0.16/0.45 # Condensation attempts : 18 0.16/0.45 # Condensation successes : 0 0.16/0.45 # Termbank termtop insertions : 1484 0.16/0.45 # Search garbage collected termcells : 117 0.16/0.45 0.16/0.45 # ------------------------------------------------- 0.16/0.45 # User time : 0.002 s 0.16/0.45 # System time : 0.001 s 0.16/0.45 # Total time : 0.004 s 0.16/0.45 # Maximum resident set size: 1760 pages 0.16/0.45 0.16/0.45 # ------------------------------------------------- 0.16/0.45 # User time : 0.004 s 0.16/0.45 # System time : 0.002 s 0.16/0.45 # Total time : 0.006 s 0.16/0.45 # Maximum resident set size: 1712 pages 0.16/0.45 % E exiting 0.16/0.45 % E exiting 0.16/0.45 EOF